Conscious and controlling elements in combinatorial group testing problems with more defectives

نویسندگان

  • Dániel Gerbner
  • Máté Vizer
چکیده

In combinatorial group testing problems Questioner needs to find a defective element x ∈ [n] by testing subsets of [n]. In [18] the authors introduced a new model, where each element knows the answer for those queries that contain it and each element should be able to identify the defective one. In this article we continue to investigate this kind of models with more defective elements. We also consider related models inspired by secret sharing models, where the elements should share information among them to find out the defectives. Finally the adaptive versions of the different models are also investigated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strict group testing and the set basis problem

Group testing is the problem to identify up to d defectives out of n elements, by testing subsets for the presence of defectives. Let t(n, d, s) be the optimal number of tests needed by an s-stage strategy in the strict group testing model where the searcher must also verify that at most d defectives are present. We start building a combinatorial theory of strict group testing. We compute many ...

متن کامل

A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies

Group testing is the problem of identifying up to d defectives in a set of n elements by testing subsets for the presence of defectives. Let t(n, d, s) be the optimal number of tests needed by an s-stage strategy in the strict group testing model where the searcher must also verify that no more than d defectives are present. We develop combinatorial tools that are powerful enough to compute man...

متن کامل

Group Testing with Multiple Mutually-Obscuring Positives

Group testing is a frequently used tool to identify an unknown set of defective (positive) elements out of a large collection of elements by testing subsets (pools) for the presence of defectives. Various models have been studied in the literature. The most studied case concerns only two types (defective and non-defective) of elements in the given collection. This paper studies a novel and natu...

متن کامل

When is Individual Testing Optimal for Nonadaptive Group Testing?

The combinatorial group testing problem is, assuming the existence of up to d defectives among n items, to identify the defectives by as few tests as possible. In this paper, we study the problem for what values of n, given d, individual testing is optimal in nonadaptive group testing. Let N(d) denote the largest n for fixed d for which individual testing is optimal. We will show that N(d) = (d...

متن کامل

Randomized Group Testing Both Query-Optimal and Minimal Adaptive

The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defective, and No if the subset is free of defectives. By the entropy lower bound, log2 ∑d

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1705.08539  شماره 

صفحات  -

تاریخ انتشار 2017